Polish topologies on endomorphism monoids of relational structures

نویسندگان

چکیده

In this paper we present general techniques for characterising minimal and maximal semigroup topologies on the endomorphism monoid End(A) of a countable relational structure A. As applications, show that monoids several well-known structures, including random graph, directed partial order, possess unique Polish topology. every case topology is subspace induced by usual Baire space NN. We also many these structures have property homomorphism from their to second topological continuous; referred as automatic continuity. Many results about are extended clones polymorphisms same structures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Endomorphism monoids of chained graphs

For any complete chain I whose distinct elements are separated by cover pairs, and for every family {Mi | i∈ I} of monoids, we construct a family of graphs {Gi | i∈ I} such that Gi is a proper induced subgraph of Gj for all i; j∈ I with i ¡ j, Gi = ⋂ {Gj | j∈ I; i ¡ j} whenever i = inf{ j∈ I | j¿ i} in I , Gi = ⋃ {Gj | j∈ I; j ¡ i} whenever i = sup{ j∈ I | j¡ i} in I , the endomorphism monoid o...

متن کامل

A method of finding automorphism groups of endomorphism monoids of relational systems

For any set X and any relation on X, let T (X, ) be the semigroup of all maps a : X → X that preserve . Let S(X) be the symmetric group on X. If is reflexive, the group of automorphisms of T (X, ) is isomorphic toNS(X)(T (X, )), the normalizer of T (X, ) in S(X), that is, the group of permutations on X that preserve T (X, ) under conjugation. The elements ofNS(X)(T (X, )) have been described fo...

متن کامل

On Endomorphism Monoids of Partial Orders and Central Relations

In this paper we characterize pairs of Rosenberg relations (ρ, σ) with the property that the endomorphism monoid of one of the relations is properly contained in the endomorphism monoid of the other relation. We focus on the situations where one of the relations is a partial order, or a central relation. AMS Mathematics Subject Classification (2000): 08A35, 06A06

متن کامل

Topologies on Free Monoids Induced by Families of Languages

For i f c^> (£*) the language operator Anf^ (A) is defined by {z\ z\A e^}. Itwas characterized what families JSf correspond to ciosure operators. In this paper the families Z£ are found out corresponding to interior operators: they are filters with a special property. For the case of principal filters <£= {A\A=IL} such a family is obtained iff L is a monoid. Thus from euery monoid a topology ca...

متن کامل

Rippling on Relational Structures

The rippling heuristic has been rather successfully used to guide inductive proofs in a functional framework. We present here how that heuristic can be formalized in a relational framework, more adapted to logic programming. The rippling heuristic is rst analysed to identify its key components. A formalization of these to a relational framework is then presented. The applicability and the power...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2023

ISSN: ['1857-8365', '1857-8438']

DOI: https://doi.org/10.1016/j.aim.2023.109214